A New Fast Iterative Blind Deconvolution Algorithm

A fast iterative thresholding algorithm for wavelet-regularized deconvolution

We present an iterative deconvolution algorithm that minimizes a functional with a non-quadratic waveletdomain regularization term. Our approach is to introduce subband-dependent parameters into the bound optimization framework of Daubechies et al.; it is sufficiently general to cover arbitrary choices of wavelet bases (non-orthonormal or redundant). The resulting procedure alternates between t...

A Fast Fixed-Point Neural Blind Deconvolution Algorithm

The aim of the present Letter is to introduce a new blind deconvolution algorithm based on fixed-point optimization of a ‘Bussgang’-type cost function. The cost function relies on approximate Bayesian estimation achieved by an adaptive neuron. The main feature of the presented algorithm is fast convergence that guarantees good deconvolution performances with limited computational demand compare...

Iterative blind deconvolution algorithm applied to phase retrieval

The iterative blind deconvolution algorithm proposed by Ayers and Dainty [Opt. Lett. 13,547 (1988)] and improved on by Davey et al. [Opt. Commun. 69,353 (1989)] is applied to the problem of phase retrieval, which is a special case of the blind deconvolution problem. A close relationship between this algorithm and the error-reduction version of the iterative Fourier-transform phase-retrieval alg...

A New Fast Data Encryption Algorithm (FDE)

A New Fast Data Encryption Algorithm (FDE)